On generating binary words palindromically
نویسندگان
چکیده
منابع مشابه
On generating binary words palindromically
We regard a finite word u = u1u2 · · ·un up to word isomorphism as an equivalence relation on {1, 2, . . . , n} where i is equivalent to j if and only if ui = uj. Some finite words (in particular all binary words) are generated by palindromic relations of the form k ∼ j+i−k for some choice of 1 ≤ i ≤ j ≤ n and k ∈ {i, i+1, . . . , j}. That is to say, some finite words u are uniquely determined ...
متن کاملGenerating All Minimal Petri Net Unsolvable Binary Words
Sets of finite words, as well as some infinite ones, can be described using finite systems, e.g. automata. On the other hand, some automata may be constructed with use of even more compact systems, like Petri nets. We call such automata Petri net solvable. In this paper we consider the solvability of singleton languages over a binary alphabet (i.e. binary words). An unsolvable (i.e. not solvabl...
متن کاملOn Binary Words Being Petri Net Solvable
A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable words is studied.
متن کاملOn Generalized Pseudostandard Words Over Binary Alphabets
In this paper, we study generalized pseudostandard words over a two-letter alphabet, which extend the classes of standard Sturmian, standard episturmian and pseudostandard words, allowing different involutory antimorphisms instead of the usual
متن کاملOn Weak Circular Squares in Binary Words
A weak square in a binary word is a pair of adjacent non-empty blocks of the same length, having the same number of 1s. A weak circular square is a weak square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are equivalent if they have the same length and contain the same number of ones. We prove ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2015
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2014.10.003